Scheduling Periodic Wireless Data Broadcast

We develop simple heuristics, called \MAX" and \MAX-LD", to nd a sub-optimal solution for scheduling data for periodic wireless broadcasts. We also develop a lower bound for a branch-and-bound algorithm, which we call \B&B", to determine the optimal layout for the broadcast. We evaluate these algorithms experimentally and show that B&B runs considerably faster than exhaustive enumeration while producing an optimal solution. We then show that the heuristics MAX and MAX-LD run substantially faster than B&B while giving solutions that are only slightly worse than the optimum. We conclude with a brief analysis of our experimental results and end with possibilities for future work in this area.